The graphs are a faithful map of the dynasome

ثبت نشده
چکیده

First, to make contact with the entirely PCA-based visualisations, the position of each protein in the plane spanned by dynasome descriptors 1 and 2 (cf. main text Fig. 4) is indicated as an arrow overlying the protein’s vertex in Fig. 9b. As can be seen, most proteins of the same cluster have similar positions in the plane of dynasome descriptor 1 and 2. Exceptions to this general observation are, to a different degree in different clusters, rather found close to the cluster borders, where proteins already tend to assume intermediate positions between the typical positions of the two neighbouring clusters. A second observation from Fig. 9b, which can also be derived from the arrows, is that different clusters may have almost identical positions in Fig. 4. Thus, the information conveyed by dynasome descriptors 1 and 2 are not masked by the higher dimensions, because clusters of proteins identified in Fig. 9b are fairly consistent in terms of positions on the plane of these descriptors 1 and 2. On the contrary, the properties described by higher descriptors allow for a clear discrimination between proteins which almost overlie each other on the plane of descriptors 1 and 2, i.e. which are almost identical in terms of ruggedness, overall flexibility and typical timescales. This is visible by the fact that even distant clusters in Fig. 9b are almost identical in terms of descriptors 1 and 2 (arrows). From Fig. 9 it is also evident that, as speculated before, the reasons for the significant point overlap in Fig. 4 is indeed the fact that descriptors 1 and 2 do not characterize all the different aspects of protein dynamics in sufficient detail to descriminate clearly between classes of protein dynamics. More dynasome descriptors are needed to this end, and further analyses showed that the first four dynasome descriptors are sufficient to uniquely describe all clusters. As a second test, to compare this result with our previous k-means partitioning of the dynamics space, we mapped the k-means clusters into the graphs (Fig. S5a). As can be seen, the k-means partitioning does not contradict our graph partitions, but is much more coarse-grained and not suitable to resolve the fine structure of the dynamics space. Thus, it is likely that the k-means structure/dynamics correlation analysis (Fig. 6) can be improved by comparing the positions of the proteins in the graph (Fig. 9) with their structure class. Fig. S5b has the vertices coloured according to the protein’s SCOP class. The comparison of Fig. S5a with Fig. S5b shows that indeed the k-means clusters do not find clear-cut separations between structure classes, because there is no such obvious separation but at most an accumulation of all-β and α/β proteins on the l.h.s. of the graph, a fact which is described by the k-means partitioning. Interestingly however, adjoint/disjoint dynamics are also visible in Fig. S5b from close-by/distant vertices of different/equal colour. Taken together, these checks suggest that the graphs of the dynasome are indeed a faithful representation of the structure of our dynamics space.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CATEGORY OF (POM)L-FUZZY GRAPHS AND HYPERGRAPHS

In this note by considering a complete lattice L, we define thenotion of an L-Fuzzy hyperrelation on a given non-empty set X. Then wedefine the concepts of (POM)L-Fuzzy graph, hypergraph and subhypergroupand obtain some related results. In particular we construct the categories ofthe above mentioned notions, and give a (full and faithful) functor form thecategory of (POM)L-Fuzzy subhypergroups ...

متن کامل

On a functional equation for symmetric linear operators on $C^{*}$ algebras

‎Let $A$ be a $C^{*}$ algebra‎, ‎$T‎: ‎Arightarrow A$ be a linear map which satisfies the functional equation $T(x)T(y)=T^{2}(xy),;;T(x^{*})=T(x)^{*} $‎. ‎We prove that under each of the following conditions‎, ‎$T$ must be the trivial map $T(x)=lambda x$ for some $lambda in mathbb{R}$: ‎‎ ‎i) $A$ is a simple $C^{*}$-algebra‎. ‎ii) $A$ is unital with trivial center and has a faithful trace such ...

متن کامل

Edge pair sum labeling of some cycle related graphs

Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...

متن کامل

Skolem Odd Difference Mean Graphs

In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012